A New Inference Algorithm of Dynamic Uncertain Causality Graph Based on Conditional Sampling Method for Complex Cases
نویسندگان
چکیده
Dynamic Uncertain Causality Graph(DUCG) is a recently proposed model for diagnoses of complex systems. It performs well industry system such as nuclear power plants, chemical and spacecrafts. However, the variable state combination explosion in some cases still problem that may result inefficiency or even disability DUCG inference. In situation clinical diagnoses, when lot intermediate causes are unknown while downstream results known graph, appear during inference computation. Monte Carlo sampling typical algorithm to solve this problem. we facing case occurrence rate very small, e.g. $10^{-20}$, which means huge number samplings needed. This paper proposes new scheme based on conditional stochastic simulation obtains final from expectation probability loops instead counting frequency, thus overcomes As result, requires much less time than recursive presented earlier. Moreover, simple analysis convergence designed example given show advantage method. % addition, supports logic gate, cycles, parallelization, exist DUCG, also addressed paper. The reduces consumption 3 times faster old one with 2.7% error ratio practical graph Viral Hepatitis B.
منابع مشابه
A Graph-Based Inference Method for Conditional Independence
The graphoid axioms for conditional independence, originally described by Dawid [1979], are fundamental to probabilistic reasoning [Pearl, 1988]. Such axioms provide a mechanism for manipulating conditional independence assertions without resorting to their numerical definition. This paper explores a representation for independence statements using multiple undirected graphs and some simple gra...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولapplication of upfc based on svpwm for power quality improvement
در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...
15 صفحه اولSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملA New Maximum Power Point Tracking Method for PEM Fuel Cells Based On Water Cycle Algorithm
Maximum Power Point (MPP) tracker has an important role in the performance of fuel cell (FC) systems improvement. Tow parameters which have effect on the Fuel cell output power are temperature and membrane water. So contents make the MPP change by with variations in each parameter. In this paper, a new maximum power point tracking (MPPT) method for Proton Exchange Membrane (PEM) fuel cell is pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3093205